Parsimony hierarchies for inductive inference

Parsimony hierarchies for inductive inference

Freivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size, i.e, within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is co...

Parsimony Doesn't Mean Simplicity: Genetic Programming for Inductive Inference on Noisy Data

A Genetic Programming algorithm based on Solomonoff’s probabilistic induction is designed and used to face an Inductive Inference task, i.e., symbolic regression. To this aim, some test functions are dressed with increasing levels of noise and the algorithm is employed to denoise the resulting function and recover the starting functions. Then, the algorithm is compared against a classical parsi...

Mod/Resc Parsimony Inference

We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria. In this problem, that we denote by Mod/Resc Parsimony Inference, we are given a boolean matrix and the goal is to find two other boolean matrices with a mi...

Inductive parsimony and the Methodological Argument.

Studies on so-called Change Blindness and Inattentional Blindness have been taken to establish the claim that conscious perception of a stimulus requires the attentional processing of that stimulus. One might contend, against this claim, that the evidence only shows attention to be necessary for the subject to have access to the contents of conscious perception and not for conscious perception ...

Phylogenetic inference and parsimony analysis.